Hardware-driven visibility culling

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visibility Driven Rasterization

We present a new visibility driven rasterization scheme that significantly increases the rendering performance of modern graphic subsystems. Instead of rasterizing, texturing, lighting, and depth-testing each individual pixel, we introduce a two-level visibility mask within the rasterization stage which facilitates the removal of groups of pixels and triangles from rasterization and subsequent ...

متن کامل

Visibility Culling per Cache Block with Tiling-Traversal Algorithm

As many applications in computer graphics require render high complex 3D scenes at interactive rates, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we proposed a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling ...

متن کامل

Ray Space Factorization for From-Region Visibility

From-region visibility culling is considered significantly harder than from-point visibility culling, since it is inherently 4dimensional. We present a conservative occlusion culling method based on factorizing the 4D visibility problem into horizontal and vertical components. The visibility of the two components is solved asymmetrically: the horizontal component is based on a novel parameteriz...

متن کامل

Visibility Driven Rasterization

Cotton-picker dataset containing 10 million triangles. Occlusion culling in z-buffer systems has drawn a lot of attention over the last few years.1,3 Due to the high computational costs of occlusion queries, hardware support is required to accelerate interactive rendering. This requires mechanisms that fit nicely into an available graphics subsystem without greedily consuming chip real estate (...

متن کامل

Ray Space Factorization for From-Region Visibility

We present a fast conservative from-region visibility method capable of handling 3D models using arbitrary 3D triangles as occluders. The from-region visibility problem is considered significantly harder than the from-point visibility problem, since it is inherently 4-dimensional. Our occlusion culling method is based on factorizing the 4D visibility problem into horizontal and vertical compone...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007